Maximal sensitivity under Strong Anonymity
نویسندگان
چکیده
This paper re-examines the incompatibility of Strong Pareto, as an axiom sensitivity, and Anonymity, impartiality, when comparing well-being profiles with a countably infinite number components. We ask how far Paretian principle can be extended without contradicting Anonymity. show that Anonymity combined four auxiliary axioms has two consequences: (i) There is sensitivity for increase in one component if only co-finite set other components are at least ɛ (>0) higher, (ii) adding people to population cannot have positive social value.
منابع مشابه
Anonymity Trilemma: Strong Anonymity, Low Bandwidth, Low Latency—Choose Two
This work investigates the fundamental constraintsof anonymous communication (AC) protocols. We analyze therelationship between bandwidth overhead, latency overhead, andsender anonymity or recipient anonymity against the globalpassive (network-level) adversary. We confirm the trilemma thatan AC protocol can only achieve two out of the following threeproperties: strong an...
متن کاملAn Efficient Communication System With Strong Anonymity
Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on the other hand, protect the users against traffic analysis attacks, but sacrifice bandwidth. Verifiable mixnets maintain strong anonymity wi...
متن کاملDissent in Numbers: Making Strong Anonymity Scale
Current anonymous communication systems make a trade-off between weak anonymity among many nodes, via onion routing, and strong anonymity among few nodes, via DC-nets. We develop novel techniques in Dissent, a practical group anonymity system, to increase by over two orders of magnitude the scalability of strong, traffic analysis resistant approaches. Dissent derives its scalability from a clie...
متن کاملSecret Handshake: Strong Anonymity Definition and Construction
Secret handshake allows two members in the same group to authenticate each other secretly. In previous works of secret handshake schemes, two types of anonymities against the group authority (GA) of a group G are discussed: 1)Even GA cannot identify members, namely nobody can identify them (No-Traceability), 2)Only GA can identify members (Traceability). In this paper, first the necessity of tr...
متن کاملMixminion: Strong Anonymity for Financial Cryptography
Anonymous communication is a valuable but underused tool for securing financial communications. As early as the first commercial telegraph codes, businesses have recognized the value of cryptography to protect their communication from prying eyes. But cryptography alone still allows adversaries to discover confidential business relationships by performing traffic analysis to reveal the presence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2022
ISSN: ['1873-1538', '0304-4068']
DOI: https://doi.org/10.1016/j.jmateco.2022.102768